K-Adaptability in Two-Stage Robust Binary Programming
نویسندگان
چکیده
منابع مشابه
K-adaptability in two-stage distributionally robust binary programming
We propose to approximate two-stage distributionally robust programs with binary recourse decisions by their associated K-adaptability problems, which pre-select K candidate secondstage policies here-and-now and implement the best of these policies once the uncertain parameters have been observed. We analyze the approximation quality and the computational complexity of the K-adaptability proble...
متن کاملK-Adaptability in Two-Stage Robust Binary Programming
Over the last two decades, robust optimization has emerged as a computationally attractive approach to formulate and solve single-stage decision problems affected by uncertainty. More recently, robust optimization has been successfully applied to multi-stage problems with continuous recourse. This paper takes a step towards extending the robust optimization methodology to problems with integer ...
متن کاملK-Adaptability in Two-Stage Mixed-Integer Robust Optimization
We study two-stage robust optimization problems with mixed discrete-continuous decisions in both stages. Despite their broad range of applications, these problems pose two fundamental challenges: (i) they constitute infinite-dimensional problems that require a finite-dimensional approximation, and (ii) the presence of discrete recourse decisions typically prohibits dualitybased solution schemes...
متن کاملA two-stage robust model for portfolio selection by using goal programming
In portfolio selection models, uncertainty plays an important role. The parameter’s uncertainty leads to getting away from optimal solution so it is needed to consider that in models. In this paper we presented a two-stage robust model that in first stage determines the desired percentage of investment in each industrial group by using return and risk measures from different industries. One rea...
متن کاملDecomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
In this paper, we introduce and study a two-stage distributionally robust mixed binary problem (TSDR-MBP) where the random parameters follow the worst-case distribution belonging to an uncertainty set of probability distributions. We present a decomposition algorithm, which utilizes distribution separation procedure and parametric cuts within Benders’ algorithm or Lshaped method, to solve TSDR-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2015
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.2015.1392